Multiple - Valued Horn
نویسنده
چکیده
منابع مشابه
α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems
In this paper, an α-resolution method for a set of lattice-valued Horn generalized clauses is established in lattice-valued propositional logic systemL P(X) based on lattice implication algebra. Firstly, the notions of lattice-valued Horn generalized clause, normal lattice-valued Horn generalized clause and unit latticevalued Horn generalized clause are given in L P(X). Then, the α-resolution o...
متن کاملA Semantics for Concurrent Logic Programming Languages Based on Multiple- Valued Logic
In order to obtain an understanding of parallel logic thought it is necessary to establish a fully abstract model of the denotational semantics of logic programming languages. In this paper, a fixed point semantics for the committed choice, nondeterministic family of parallel programming languages, i.e. the concurrent logic programming languages is developed. The approach is from an order theor...
متن کاملBoolean Valued Models and Incomplete Specifications
Logic programming has favored universal Horn theories for several reasons. An advantage of consistent universal Horn theories, compared with arbitrary consistent theories, is the fact that they possess a “typical” model-the least Herbrand model. More precisely, in order to verify that a sentence of the form 3 X, . . . 3 x, A, where A is a conjunction of atomic formulas (i.e. positive literals),...
متن کاملAn Evidence-based Framework for a Theory of Inheritance
We present an approach to formalizing nonmonotonic multiple inheritance networks by combining concepts from logic programming and multi-valued logics in a uniform framework. A Horn-clause logic language is used for specifying inheritance networks. This allows a natural representation of class-subclass hierarchies and ambiguous inheritance networks. It also provides means for resolving ambiguiti...
متن کاملStratified , Weak Stratified , and Three - valued Semantics ∗
We investigate the relationship between three-valued Kripke/Kleene semantics and stratified semantics for stratifiable logic programs. We first show these are compatible, in the sense that if the three-valued semantics assigns a classical truth value, the stratified approach will assign the same value. Next, the familiar fixed point semantics for pure Horn clause programs gives both smallest an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998